Matrix-free interior point method for compressed sensing problems
نویسندگان
چکیده
منابع مشابه
Matrix-free interior point method for compressed sensing problems
We consider a class of optimization problems for sparse signal reconstruction which arise in the field of Compressed Sensing (CS). A plethora of approaches and solvers exist for such problems, for example GPSR, FPC AS, SPGL1, NestA, `1 `s, PDCO to mention a few. CS applications lead to very well conditioned optimization problems and therefore can be solved easily by simple first-order methods. ...
متن کاملMatrix-free interior point method
In this paper we present a redesign of a linear algebra kernel of an interior point method to avoid the explicit use of problem matrices. The only access to the original problem data needed are the matrix-vector multiplications with the Hessian and Jacobian matrices. Such a redesign requires the use of suitably preconditioned iterative methods and imposes restrictions on the way the preconditio...
متن کاملGPU Acceleration of the Matrix-Free Interior Point Method
Interior point methods (IPM) with direct solution of the underlying linear systems of equations have been used successfully to solve very large scale linear programming (LP) problems. However, the limitations of direct methods for some classes of problems have led to iterative techniques being considered. The matrix-free method is one such approach and is so named since the iterative solution p...
متن کاملAn interior point method for constrained saddle point problems
We present an algorithm for the constrained saddle point problem with a convexconcave function L and convex sets with nonempty interior. The method consists of moving away from the current iterate by choosing certain perturbed vectors. The values of gradients of L at these vectors provide an appropriate direction. Bregman functions allow us to define a curve which starts at the current iterate ...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2013
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-013-0063-6